A queue based mutual exclusion algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deconstructing Queue-Based Mutual Exclusion

 Deconstructing Queue-Based Mutual Exclusion

متن کامل

An O(vn) Distributed Mutual Exclusion Algorithm Using Queue Migration

In this paper a distributed algorithm is proposed that realises mutual exclusion among n nodes in a computer network. There is no common or global memory shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The proposed algorithm is based on queue migration and achieves a message complexity of O(√n) per mutual ...

متن کامل

When does a correct mutual exclusion algorithm guarantee mutual exclusion?

Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...

متن کامل

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion

Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Informatica

سال: 2008

ISSN: 0001-5903,1432-0525

DOI: 10.1007/s00236-008-0086-z